AND path in a binary tree - HackerEarth Solution

t = int(input())

arr = [0] * int(10**5 + 5)
counts = [0] * int(10**5 + 5)

arr[3] = 1
counts[3] = 1
count = 1

for j in range(4, 10**5 + 5):
    if j%2==0:
        arr[j] = arr[j-1]
        continue
    elif (j//2)%2 ==0 :
        arr[j] = arr[j-1]
        continue

    counts[j] =  1 + counts[j//2]

    count += counts[j]
    arr[j] = count


for i in range(t):
    s = int(input())
    print(arr[s])